Kaczmarz Algorithm and Frames
نویسندگان
چکیده
Sequences of unit vectors for which the Kaczmarz algorithm always converges in Hilbert space can be characterized in frame theory by tight frames with constant 1. We generalize this result to the context of frames and bases. In particular, we show that the only effective sequences which are Riesz bases are orthonormal bases. Moreover, we consider the infinite system of linear algebraic equations Ax = b and characterize the (bounded) matrices A for which the Kaczmarz algorithm always converges to a solution.
منابع مشابه
Kaczmarz Algorithm in Hilbert Space and Tight Frames
We prove that any tight frame in Hilbert space can be obtained by the Kaczmarz algorithm. An explicit way of constructing this correspondence is given. The uniqueness of the correspondence is determined.
متن کاملAccelerating Random Kaczmarz Algorithm Based on Clustering Information
Kaczmarz algorithm is an efficient iterative algorithm to solve overdetermined consistent system of linear equations. During each updating step, Kaczmarz chooses a hyperplane based on an individual equation and projects the current estimate for the exact solution onto that space to get a new estimate. Many vairants of Kaczmarz algorithms are proposed on how to choose better hyperplanes. Using t...
متن کاملAccelerated Kaczmarz Algorithms using History Information
The Kaczmarz algorithm is a well known iterative method for solving overdetermined linear systems. Its randomized version yields provably exponential convergence in expectation. In this paper, we propose two new methods to speed up the randomized Kaczmarz algorithm by utilizing the past estimates in the iterations. The first one utilize the past estimates to get a preconditioner. The second one...
متن کاملRandomized Block Kaczmarz Method with Projection for Solving Least Squares
The Kaczmarz method is an iterative method for solving overcomplete linear systems of equations Ax = b. The randomized version of the Kaczmarz method put forth by Strohmer and Vershynin iteratively projects onto a randomly chosen solution space given by a single row of the matrix A and converges exponentially in expectation to the solution of a consistent system. In this paper we analyze two bl...
متن کاملA new frequency domain system identification method
A new frequency domain system identification method based on a multi-frequency input signal is proposed. Frequency contents of the oscillating signal are estimated using a modified Kaczmarz algorithm proposed in this paper. Lyapunov stability analysis is performed for this new Kaczmarz algorithm and transient bounds for estimation error are established. Moreover, a new method for estimation of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJWMIP
دوره 11 شماره
صفحات -
تاریخ انتشار 2013